package wzs.arithmetics;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Hashtable;

public class Test_wzs24
{
	public static void main(String[] args)
	{
		int cnt = 0;
		for (int i = 10000; i < 99999; i++)
		{
			if (String.valueOf(i).equalsIgnoreCase(String.valueOf(palindrome(i))))
			{
				System.out.println(i + "-->is palindrome");
				System.out.println(++cnt);
			}
		}
	}
	
	public static int palindrome(int number)
	{
		String numberString = String.valueOf(number);
		StringBuffer sb = new StringBuffer(numberString);
		return Integer.valueOf((sb.reverse().toString())); 
	}
	
	
}
